Solution of sparse positive definite systems on a hypercube
نویسندگان
چکیده
منابع مشابه
Superfast Solution of Real Positive Definite Toeplitz Systems
Abstract. We describe an implementation of the generalized Schur algorithm for the superfast solution of real positive definite Toeplitz systems of order n + 1, where n = 2ν . Our implementation uses the split-radix fast Fourier transform algorithms for real data of Duhamel. We are able to obtain the nth Szegő polynomial using fewer than 8n log 2 n real arithmetic operations without explicit us...
متن کاملOn positive definite solution of a nonlinear matrix equation
In this paper, an efficient iterative method is presented to solve a new nonlinear matrix equation * r X A X A I with real matrices and r 1 . Some properties of the positive definite solutions for the nonlinear matrix equation are derived. Moreover, necessary and sufficient conditions for the existence of the positive definite solutions are derived. The error estimation of the iterative m...
متن کاملRiemannian Sparse Coding for Positive Definite Matrices
Inspired by the great success of sparse coding for vector valued data, our goal is to represent symmetric positive definite (SPD) data matrices as sparse linear combinations of atoms from a dictionary, where each atom itself is an SPD matrix. Since SPD matrices follow a non-Euclidean (in fact a Riemannian) geometry, existing sparse coding techniques for Euclidean data cannot be directly extende...
متن کاملA Sparse Approximate Inverse Preconditioner for Nonsymmetric Positive Definite Matrices
We develop an algorithm for computing a sparse approximate inverse for a nonsymmetric positive definite matrix based upon the FFAPINV algorithm. The sparse approximate inverse is computed in the factored form and used to work with some Krylov subspace methods. The preconditioner is breakdown free and, when used in conjunction with Krylovsubspace-based iterative solvers such as the GMRES algorit...
متن کاملPositive Definite and Semi-definite Splitting Methods for Non-hermitian Positive Definite Linear Systems
In this paper, we further generalize the technique for constructing the normal (or positive definite) and skew-Hermitian splitting iteration method for solving large sparse nonHermitian positive definite system of linear equations. By introducing a new splitting, we establish a class of efficient iteration methods, called positive definite and semi-definite splitting (PPS) methods, and prove th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 1989
ISSN: 0377-0427
DOI: 10.1016/0377-0427(89)90364-6